Note on Permutations in a Finite Field

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutations in a Finite Field

For q = 5, this was proved to be true by Betti; for q = 7 the corresponding result was verified by Dickson [l, p. 119]. In this note we show very simply that this result holds for all q. Since the totality of permutation polynomials evidently furnishes a representation of the symmetric group on q letters, it will suffice to show that every transposition (Oa) can be generated by means of the spe...

متن کامل

A note on permutations and rank aggregation

In this brief note we consider rank aggregation, a popular method in voting theory, social choice, business decisions etc. Mathematically the problem is to find a permutation – viewed as a vector – that minimizes the sum of the `1-distances to a given family of permutations. The problem may be solved as an assignment problem and we establish several properties of optimal solutions in this problem.

متن کامل

Note on Packing Patterns in Colored Permutations

Packing patterns in permutations concerns finding the permutation with the maximum number of a prescribed pattern. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently the packing density for all but two (up to equivalence) patterns up to...

متن کامل

a note on finite c-tidy groups

let $g$ be a group and $x in g$‎. ‎the cyclicizer of $x$ is defined to be the subset $cyc(x)=lbrace y in g mid langle x‎, ‎yrangle ; {rm is ; cyclic} rbrace$‎. ‎$g$ is said to be a tidy group if $cyc(x)$ is a subgroup for all $x in g$‎. ‎we call $g$ to be a c-tidy group if $cyc(x)$ is a cyclic subgroup for all $x in g setminus k(g)$‎, ‎where $k(g)$ is the intersection of all the cyclicizers in ...

متن کامل

A note on APN permutations in even dimension

APN permutations in even dimension are vectorial Boolean functions that play a special role in the design of block ciphers. We study their properties, providing some general results and some applications to the low-dimension cases. In particular, we prove that none of their components can be quadratic. For an APN vectorial Boolean function (in even dimension) with all cubic components we prove ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1955

ISSN: 0002-9939

DOI: 10.2307/2032646